Double Fixed-Polarity Reed-Muller Expressions: A New Class of AND-EXOR Expressions for Compact and Testable Realization

نویسندگان

  • Takashi Hirayama
  • Kazuyuki Nagasawa
  • Yasuaki Nishitani
  • Kensuke Shimizu
چکیده

As classes of AND-EXOR expressions, PPRMs, FPRMs, and ESOPs are well-known. In this paper, a new class of AND-EXOR expressions, Double Fixed-Polarity Reed-Muller Expressions (DFPRMs), is proposed. DFPRMs are generalized expressions of FPRMs, and can be the smallest PLA among all the classes of AND-EXOR expressions. We discuss their properties: the relation to other classes, a compact realization with (AND/OR)-EXOR PLAs, and the easy testability of the PLA. We show that all the stuck-at faults in DFPRM PLAs are detected by (2n+4) tests, which are independent of the functions realized by the PLAs. And we demonstrate the compactness of DFPRMs by giving a table of the number of products of the minimum DFPRMs for all 4-variable functions. The table is obtained by a minimization algorithm presented in this paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easily Testable Realizations for Generalized Reed-Muller Expressions

This paper presents a design method of easily testable AND-EXOR networks. It is an improvement of Reddy and SalujaReddy’s methods, and has the following features: 1) The network uses generalized Reed-Muller expressions (GRMs) instead of Positive Polarity Reed-Muller expressions (PPRMs). The average number of products for GRMs is less than half of that for PPRMs, and is less than that of sum-of-...

متن کامل

Fixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees

This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...

متن کامل

Highly Testable Finite State Machines Based on EXOR Logic

It is well-known that AND/EXOR circuits are more easily testable than AND/OR circuits. Therefore, in this paper, we primarily propose to use AND/EXOR realizations for implementation of the combinational logic parts of finite state machines. Then, we investigate the effect of different state assignments (i.e. one-hot, gray-code, etc.) and that of using different types of registers (i.e. D-type, ...

متن کامل

The Eigenfunction of the Reed-Muller Transformation

We introduce eigenfunctions of the Reed-Muller transform. Eigenfunctions are functions whose canonical sumof-products expression and PPRM (positive polarity ReedMuller expression) are isomorphic. In the case of symmetric functions, the eigenfunction can be viewed as a function whose reduced truth vector is identical to the reduced ReedMuller spectrum. We show that the number of symmetric (ordin...

متن کامل

A New Exact Algorithm for Highly Testable Generalized Partially Mixed Polarity Reed Muller Forms

Generalized Partially Mixed Polarity Reed Muller GPMPRM expansions are a canonical sub family of Generalized Reed Muller GRM expansions and super family of Fixed Polarity Reed Muller FPRM expansions The main motivation to study GPM PRM forms is their very high testability similar to FPRM forms and better than GRMs which are also highly testable Since GPMPRM sub family of ESOP is much larger tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001